Context Preserving Crossover in Genetic Programming
نویسنده
چکیده
This paper introduces two new crossover operators for Genetic Programming (GP). Contrary to the regular GP crossover, the operators presented attempt to preserve the context in which subtrees appeared in the parent trees. A simple coordinate scheme for nodes in an S-expression tree is proposed, and crossovers are only allowed between nodes with exactly or partially matching coordinates.
منابع مشابه
Crossover and Bloat in the Functionality Model of Enzyme Genetic Programming
The functionality model is a new approach in enzyme genetic programming which enables the evolution of variable length solutions whilst preserving local context. This paper introduces the model and presents an analysis of crossover and the evolution of program size.
متن کاملGeneral Schema Theory for Genetic Programming with Subtree-Swapping Crossover: Part II
This paper is the second part of a two-part paper which introduces a general schema theory for genetic programming (GP) with subtree-swapping crossover (Part I (Poli and McPhee, 2003)). Like other recent GP schema theory results, the theory gives an exact formulation (rather than a lower bound) for the expected number of instances of a schema at the next generation. The theory is based on a Car...
متن کاملExact Schema Theory for GP and Variable-length GAs with Homologous Crossover
In this paper we present a new exact schema theory for genetic programming and variable-length genetic algorithms which is applicable to the general class of homologous crossovers. These are a group of operators, including GP one-point crossover and GP uniform crossover, where the offspring are created preserving the position of the genetic material taken from the parents. The theory is based o...
متن کاملDimensionality Reduction and Improving the Performance of Automatic Modulation Classification using Genetic Programming (RESEARCH NOTE)
This paper shows how we can make advantage of using genetic programming in selection of suitable features for automatic modulation recognition. Automatic modulation recognition is one of the essential components of modern receivers. In this regard, selection of suitable features may significantly affect the performance of the process. Simulations were conducted with 5db and 10db SNRs. Test and ...
متن کاملGeneral Schema Theory for Genetic Programming with any Subtree-Swapping Crossover
In this paper a new general schema theory for genetic programming is presented. Like other recent GP schema theory results (Poli 2000a, Poli 2000b), the theory gives an exact formulation (rather than a lower bound) for the expected number of instances of a schema at the next generation. The theory is based on a Cartesian node reference system which makes it possible to describe programs as func...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994